A Proposal for Exhaustive Search on Desktop Data
نویسندگان
چکیده
منابع مشابه
A Proposal for Desktop Retrieval Track
1 Motivation Every day we work with our personal textual information, e.g. with emails, working documents or presentation slides. The amount of documents on a single PC grew up to dozens and hundreds of thousands. Some of them are used frequently, others are needed only once a year, but all of them are stored on our hard drive. When a user is searching for the specific contract sample, saved We...
متن کاملIncreasing Search Quality with the Semantic Desktop in Proposal Development
Quicker response times and less production costs of proposal development require further automation of sales assistant functionality in CRM environments. Automation still struggles with the handling of abstraction and the subjective character of knowledge. Based on the knowledge creation framework the paper outlines and tests the increase of search quality with Semantic Desktop technology. The ...
متن کاملA nearly exhaustive search for CpG islands on whole chromosomes.
CpG islands are genome subsequences with an unexpectedly high number of CG di-nucleotides. They are typically identified using filtering criteria (e.g., G+C% expected vs. observed CpG ratio and length) and are computed using sliding window methods. Most such studies illusively assume an exhaustive search of CpG islands are achieved on the genome sequence of interest. We devise a Lexis diagram a...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولHeuristic Search vs. Exhaustive Search
A theorem proving system embodying a systematic search procedure is de sen bed. Al though the search spaces are usually infinite, and not even locally finite, the asymmetric way in which thev are generated results in a speed that is es 11ma-ted to be one to two orders of magnitude faster than the theorem provers of Quinlan and Hunt, and Chang and the problem-solver of Kikes, to whi c h this sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.06.090